Some results onπ-solvable and supersolvable groups
نویسندگان
چکیده
منابع مشابه
Some Solvable Automaton Groups
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1, m), for m 6= ±1. In addition, it is shown that, for any relatively prime integers m, n ≥ 2, the pair of Baumslag-Solitar groups BS...
متن کاملSome Quantum Analogues of Solvable Lie Groups
Introduction. In the papers [DK1-2],[DKP1-2] the quantized enveloping algebras introduced by Drinfeld and Jimbo have been studied in the case q = ε, a primitive l-th root of 1 with l odd (cf. §2 for basic definitions). Let us only recall for the moment that such algebras are canonically constructed starting from a Cartan matrix of finite type and in particular we can talk of the associated clas...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملList Decoding Group Homomorphisms Between Supersolvable Groups
We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from ...
متن کاملComputing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1994
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171294000098